搜索资源列表
GraphAlgorithm
- 用applet显示的Dijkstra算法,用于计算图论中点到点的最短距离-using applet shows the Dijkstra algorithm used in the calculation of graph theory point-to-point shortest distance
求一个Dijkstra优化算法
- 求解一个最短路径问题程序，可以参考一下求一个Dijkstra优化算法！ 谢谢了 目的是求给定两点之间的最短距离 或者改一下我的程序也行 -shortest path to solve a problem of procedure, can seek a reference Dijkstra algorithm optimization! Thank you, the purpose is scheduled for 2:00 to the shortest distance be
Zju_2584_Computer Transformation
- 这个程序实现了对N*N的格子的最短距离的计算,下载者可以修改,也可以加以加强-the process of the realization of N * N lattice of the shortest distance, can be downloaded changes can also be strengthened
实验题
- A*算法解决找路径的问题，对于特定的图形，按照距离最短的评估函数，来解决寻优问题-A * algorithm to find paths to solve the problems that specific graphics, in accordance with the shortest distance from the assessment function, to solve the optimization problem
graphic_algorithm
- 每对节点间最短路径 Floyd-Warshall 算法 D[i,j]表示从i到j的最短距离； P[i,j]表示从i到j的最短路径上j 的父节点-between each pair of nodes Shortest Path Floyd-Warshall algorithm D [i, j] said from i to j is the shortest distance; P [i, j] said from i to j the shortest path
Axing222
- 简单实现了A*寻路算法，运行时单击鼠标随机生成始点和终点，然后寻找到始点到终点的最短距离。-simple achieved A * search algorithm Road, at the click of the mouse running randomly generate starting point and destination, then find the starting point of the shortest distance between the end.
lyap_small_data_sets
- 小数据量法 求指数. 计算数组最大值.求最短距离及向量-small data Method index. Calculation array maximum. For the shortest distance vector
PotDisFromTri
- 用VC控制台程序写的一个计算任意空间点到某一个三角形的最短距离程序，可能对某些搞计算机图形学的人有帮助-VC console procedures written in a calculated arbitrary space to a certain point of a triangle shortest distance procedures, some may engage in the computer graphics help
campus_dao_you
- 数据结构中 有关于图的操作，采用visul c++ 6.0 ,界面显示校园地图，可以计算出两地间的最短距离。-data structure on the operation plan, adopted visul c 6.0, the interface shows the campus map can be worked out between the two shortest distance.
bellman
- 用C语言实现最短路径算法中的Bellman-Ford算法，这个算法可以用来解决信号处理中的一些问题。bellman_ford.c为源程序；distance.txt文件存放各界点之间的距离，以99999表示无穷大；bellman_ford.txt文件是输出文件，存放每轮循环得到的中间值，以及最后得到的到各个节点的最短距离，如果图包含负回路，文件中返回FALSE。-C language shortest path algorithm to achieve the Bellman-Ford algor
floyd_warshall
- 用C语言实现最短路径算法中的Floyd-Warshall算法，这个算法可以用来解决信号处理中的一些问题。floyd_warshall.c是源程序；distance_2.txt文件存放图中各点之间的距离，以99999表示无穷大；floyd.txt文件是输出文件，其中存放各轮得到的输出矩阵，以及最后得到的各点间最短距离，如果有负回路则返回FALSE。-C language shortest path algorithm of Floyd-Warshall algorithm, The algorit
AlogortithmsExperiment
- 在eclipse下开发的求平面上两点之间的最短距离。通过随机在平面上生成无数个点，求其中两点间的最短距离，以及这两点。-the eclipse under development for the plane between two points is the shortest distance. Through random plane generated numerous points, two points for the shortest distance, and these two p
shortestpathbetweenpoints
- 假设有一间房子,在房子丽的任意两点之间铺设电线,要求线要和墙面平行,求最短距离.用了贪婪算法.-assuming a room in the house arbitrary Korea between 2:00 cables require line parallel to the wall and, for the shortest distance. with a greedy algorithm.
mainGA9
- 多个城市间最短距离算法~希望对大家有借鉴作用~-number of cities, the shortest distance between algorithm - we hope to be useful ~
travelingsalemanproblem
- 主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n between the distance from the existi
expr2
- 旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 例如：给定4个城市{1，2，3，4}及其各城市之间的路程 最优路线是1,3,2,4,1， 其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance bet
邻接矩阵求最短路径
- 邻接矩阵的最短距离-adjacency matrix is the shortest distance
ImproveStringSimilarity_src
- String similarity , improve string similarity capture by applying shortest distance between words. This source code is implemented in C#.
GraphDis
- 一个能求图中任两顶点之间的最短距离的程序-seeking a map to the two vertices of the shortest distance between the procedures
无线传感器网络路由算法
- 无线传感器网络路由算法，采用最短路径，先搜索节点的一跳范围的距离，再搜索两跳的距离，仿真效果良好。,Wireless sensor network routing algorithm, using the shortest path first jump of the scope of the search node distance, and then search for the two jump distance, simulation results were very good.